Winograd - Thinking machines

نویسنده

  • Terry Winograd
چکیده

Artificial intelligence researchers predict that _thinking machines_ will take over our mental work, just as their mechanical predecessors were intended to eliminate physical drudgery. Critics have argued with equal fervor that _thinking machine_ is a contradiction in terms. Computers, with their foundations of cold logic, can never be creative or insightful or possess real judgment. Although my own understanding developed through active participation in artificial intelligence research, I have now come to recognize a larger grain of truth in the criticisms than in the enthusiastic predictions. The source of the difficulties will not be found in the details of silicon micro-circuits or of Boolean logic, but in a basic philosophy of patchwork rationalism that has guided the research. In this paper I review the guiding principles of artificial intelligence and argue that as now conceived it is limited to a very particular kind of intelligence: one that can usefully be likened to bureaucracy. In conclusion I will briefly introduce an orientation I call hermeneutic constructivism and illustrate how it can lead to an alternative path of design. The work presented here was supported by the System Development Foundation under a grant to the Center for the Study of Language and Information at Stanford University. A version of this paper was presented at the conference on _Humans, Animals, and Machines: Boundaries and Projections,_ sponsored by the Stanford Humanities Center in April, 1987. It was published in a volume of papers from that conference.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach to Solve Winograd Schema Challenge Using Automatically Extracted Commonsense Knowledge

The Winograd Schema Challenge has recently been proposed as an alternative to the Turing test. A Winograd Schema consists of a sentence and question pair such that the answer to the question depends on the resolution of a definite pronoun in the sentence. The answer is fairly intuitive for humans but is difficult for machines because it requires commonsense knowledge about words or concepts in ...

متن کامل

Towards Addressing the Winograd Schema Challenge - Building and Using a Semantic Parser and a Knowledge Hunting Module

Concerned about the Turing test’s ability to correctly evaluate if a system exhibits human-like intelligence, the Winograd Schema Challenge (WSC) has been proposed as an alternative. A Winograd Schema consists of a sentence and a question. The answers to the questions are intuitive for humans but are designed to be difficult for machines, as they require various forms of commonsense knowledge a...

متن کامل

The Social-Emotional Turing Challenge

the emotions of others is an essential part of being a socially functioning human. Without it we would not know what actions will most likely make others around us happy versus mad or sad. Our abilities to please friends, placate enemies, inspire our children, and secure cooperation from our colleagues would suffer. For these reasons a truly intelligent human-level AI will need the ability to r...

متن کامل

Hyperdense Coding Modulo 6 with Filter-Machines

We show how one can encode n bits with n “wave-bits” using still hypothetical filter-machines (here o(1) denotes a positive quantity which goes to 0 as n goes to infity). Our present result in a completely different computational model significantly improves on the quantum superdense-coding breakthrough of Bennet and Wiesner (1992) which encoded n bits by ⌈n/2⌉ quantumbits. We also show that ou...

متن کامل

Gemmw: a Portable Level 3 Blas Winograd Variant of Strassen's Matrix{matrix Multiply Algorithm

Matrix{matrix multiplication is normally computed using one of the BLAS or a reinvention of part of the BLAS. Unfortunately, the BLAS were designed with small matrices in mind. When huge, well conditioned matrices are multiplied together, the BLAS perform like the blahs, even on vector machines. For matrices where the coe cients are well conditioned, Winograd's variant of Strassen's algorithm o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011